Steiner systems S(5,6, v) with . . .

نویسنده

  • R. A. MATHON
چکیده

It is proved that there are precisely 4204 pairwise non-isomorphic Steiner systems S(5, 6, 72) invariant under the group PSL2(71) and which can be constructed using only short orbits. It is further proved that there are precisely 38717 pairwise non-isomorphic Steiner systems S(5, 6, 84) invariant under the group PSL2(83) and which can be constructed using only short orbits.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Steiner diameter of a graph

‎The Steiner distance of a graph‎, ‎introduced by Chartrand‎, ‎Oellermann‎, ‎Tian and Zou in 1989‎, ‎is a natural generalization of the‎ ‎concept of classical graph distance‎. ‎For a connected graph $G$ of‎ ‎order at least $2$ and $Ssubseteq V(G)$‎, ‎the Steiner‎ ‎distance $d(S)$ among the vertices of $S$ is the minimum size among‎ ‎all connected subgraphs whose vertex sets contain $S$‎. ‎Let $...

متن کامل

Nordhaus-Gaddum type results for the Harary index of graphs

The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...

متن کامل

An infinite family of Steiner systems S(2, 4, 2m) from cyclic codes

Steiner systems are a fascinating topic of combinatorics. The most studied Steiner systems are S(2,3,v) (Steiner triple systems), S(3,4,v) (Steiner quadruple systems), and S(2,4,v). There are a few infinite families of Steiner systems S(2,4,v) in the literature. The objective of this paper is to present an infinite family of Steiner systems S(2,4,2m) for all m ≡ 2 (mod 4)≥ 6 from cyclic codes. ...

متن کامل

Embedding Steiner triple systems into Steiner systems S(2, 4, v)

We initiate a systematic study of embeddings of Steiner triple systems into Steiner systems S(2; 4; v). We settle the existence of an embedding of the unique STS(7) and, with one possible exception, of the unique STS(9) into S(2; 4; v). We also obtain bounds for embedding sizes of Steiner triple systems of larger orders. c © 2003 Elsevier B.V. All rights reserved.

متن کامل

On the switching construction of Steiner quadruple systems

The structure of Steiner quadruple system S(v, 4, 3) of full 2-rank v− 1 is considered. It is shown that there are two types (induced and singular) of such systems. It is shown that induced Steiner systems can be obtained from Steiner systems S(v, 4, 3) of 2-rank v − 2 by switching construction which is introduced here. Moreover, all non-isomorphic induced Steiner systems S(16, 4, 3) of full 2r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997